convex polytopes造句
例句與造句
- The pattern is similar if non-convex polytopes are included.
- Schl鋐li showed that there are six regular convex polytopes in 4 dimensions.
- Branko Gr黱baum published his influential work on " Convex Polytopes " in 1967.
- The classical convex polytopes may be considered tessellations, or tilings, of spherical space.
- A comprehensive and influential book in the subject, called " Convex Polytopes ", was published in 1967 by Branko Gr黱baum.
- It's difficult to find convex polytopes in a sentence. 用convex polytopes造句挺難的
- In Gr黱baum's book, and in some other texts in discrete geometry, convex polytopes are often simply called " polytopes ".
- Gr黱baum's classic monograph " Convex polytopes ", first published in 1967, has become the main textbook on the subject.
- Much of his work has involved hard classification theorems in geometry, but his well known book on convex polytopes contains plenty of nice combinatorial formulae.
- Convex polytopes are a special subclass of Nef polyhedra, being the set of polyhedra which are the intersections of a finite set of half-planes.
- One was in convex polytopes, where he noted a tendency among mathematicians to define a " polyhedron " in different and sometimes incompatible ways to suit the needs of the moment.
- Since it may be difficult to enumerate the faces, volume computation may be challenging, and hence there exist specialized algorithms to determine the volume ( many of these generalize to convex polytopes in higher dimensions ).
- This construction determines the combinatorial structure of the vertex figure, similar to a set of connected vertices ( see below ), but not its precise geometry; it may be generalized to convex polytopes in any dimension.
- While at Princeton, Goldman came under the influence of Albert W . Tucker, with whom he published three " seminal papers " in " Annals of Mathematics Studies " on linear programming and convex polytopes.
- Even in four dimensions, the set of possible ?-vectors of convex polytopes does not form a convex subset of the four-dimensional integer lattice, and much remains unknown about the possible values of these vectors.
- He also showed that, of all convex polytopes of given surface area that are equivalent to a given Platonic solid ( e . g . a tetrahedron or a octahedron ), a regular polytope always has the largest possible volume.
更多例句: 下一頁